Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness
نویسندگان
چکیده
We introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-resolution for annotation-free many valued logic programs as defined by Fitting, and prove a soundness and completeness result relating the two. We show that fibrational se mantics corresponds with the traditional declarative (ground) semantics and deduce a soundness and completeness result for our SLD-resolution algorithm with respect to the ground semantics.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملTruth and knowledge fixpoint semantics for many-valued logic programming
The variety of semantical approaches that have been invented for logic programs for reasoning about inconsistent databases is quite broad. Especially, we are interested in an ontological encapsulation of a many-valued logics with negation, based on bilattices, into a 2-valued logic: this new approach is a minimilistic one based on the concept of the semantic reflection. We define a Model theore...
متن کاملA Fibrational Semantics for Logic Programs
We introduce a new semantics for logic programming languages. It generalises the traditional Herbrand universe semantics, and specialises the semantics of logical relations, as used in analysing parametricity in functional and imperative programming languages. We outline a typed logic programming language, give it this semantics, and show how it supports structured development of logic programs...
متن کاملStable Semantics for Disjunctive Programs
[VG89b] A. Van Gelder. Negation as failure using tight derivations for general logic programs. [Prz91c] T. C. Przymusinski. Three-valued non-monotonic formalisms and semantics of logic programs. Journal of Articial Intelligence, 1991. (In print. Extended abstract appeared in: T. C. Przy-musinski. Three-valued non-monotonic formalisms and logic programming. [Ros89b] K. Ross. The well founded sem...
متن کاملMany-valued Logic Programming and Fixpoint Semantics for Higher-order Herbrand Models
In this paper we compare the two versions of knowledge invariant transformations of the original Many-valued logic programs: the strict Annotated logic programs and the ’meta’ logic programs obtained by the ontological encapsulation [1]. We show that the first one has the higher-order Herbrand interpretations, while the last can be seen as the flattening of the first one. These two knowledge in...
متن کامل